Model Selection for High-Dimensional Quadratic Regression via Regularization

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convex Regularization for High-Dimensional Tensor Regression

In this paper we present a general convex optimization approach for solving highdimensional tensor regression problems under low-dimensional structural assumptions. We consider using convex and weakly decomposable regularizers assuming that the underlying tensor lies in an unknown low-dimensional subspace. Within our framework, we derive general risk bounds of the resulting estimate under fairl...

متن کامل

Model Selection in Gaussian Regression for High-dimensional Data

We consider model selection in Gaussian regression, where the number of predictors might be even larger than the number of observations. The proposed procedure is based on penalized least square criteria with a complexity penalty on a model size. We discuss asymptotic properties of the resulting estimators corresponding to linear and so-called 2k ln(p/k)-type nonlinear penalties for nearly-orth...

متن کامل

High-Dimensional Graphical Model Selection Using l1-Regularized Logistic Regression

We consider the problem of estimating the graph structure associated with a discrete Markov random field. We describe a method based on l1-regularized logistic regression, in which the neighborhood of any given node is estimated by performing logistic regression subject to an l1-constraint. Our framework applies to the high-dimensional setting, in which both the number of nodes p and maximum ne...

متن کامل

High-Dimensional Graphical Model Selection Using ℓ1-Regularized Logistic Regression

We focus on the problem of estimating the graph structure associated with a discrete Markov random field. We describe a method based on `1regularized logistic regression, in which the neighborhood of any given node is estimated by performing logistic regression subject to an `1-constraint. Our framework applies to the high-dimensional setting, in which both the number of nodes p and maximum nei...

متن کامل

High - Dimensional Ising Model Selection Using 1 - Regularized Logistic Regression

We consider the problem of estimating the graph associated with a binary Ising Markov random field. We describe a method based on 1-regularized logistic regression, in which the neighborhood of any given node is estimated by performing logistic regression subject to an 1-constraint. The method is analyzed under high-dimensional scaling in which both the number of nodes p and maximum neighborhoo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the American Statistical Association

سال: 2018

ISSN: 0162-1459,1537-274X

DOI: 10.1080/01621459.2016.1264956